On the Horton-Strahler number for random tries
نویسندگان
چکیده
منابع مشابه
On the Horton-Strahler Number for Random Tries
We consider random tries constructedfrom n i.i.d. séquences of independent Bernoulli (p) random variables, 0 < p < 1. We study the Horton-Strahler number Hn, and show that ëmin(p,l-p) in probability as n —*• oo.
متن کاملA Note on the Horton-Strahler Number for Random Trees
We consider the Horton-Strahler number S, for random equiprobable binary trees with n nodes. We give a simple probabilistic proof of the well-known result that ES, = log,n + O(1) and show that for every x > 0, P{ 1 S, log,n ( > x} Q D/4x, for some constant D > 0.
متن کاملAnalysis of random LC tries
LC tries were introduced by Andersson and Nilsson in 1993. They are compacted versions of tries or patricia tries in which, from the top down, maximal height complete subtrees are level compressed. Andersson and Nilsson (1993) showed that for i.i.d. uniformly distributed input strings, the expected depth of the LC patricia trie is (log n). In this paper, we reene and extend this result. We anal...
متن کاملOn the number of full levels in tries
We study the asymptotic distribution of the ll-up level in a binary trie built over n independent strings generated by a biased memoryless source. The ll-up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2 nodes). The ll-up level nds many interesting applications, e.g., in the inte...
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1996
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1996300504431